- 01. About this Lesson
- 02. How to Solve Problems
- 03. Days Between Dates
- 04. Attempting the Problem [workspace]
- 05. First Step
- 06. Understanding a Problem
- 07. The First Rule
- 08. What Are the Inputs
- 09. How Are Inputs Represented
- 10. What Are the Outputs
- 11. Obey the Rules
- 12. Next Step
- 13. The Expected Output
- 14. Take the Next Step
- 15. Try an Example
- 16. Harder Example
- 17. Algorithm Pseudocode
- 18. Should We Implement It
- 19. Different Approach
- 20. Simple Mechanical Algorithm
- 21. Don't Optimize Prematurely
- 22. What Should We Write First
- 23. Define Simple nextDay
- 24. Making Progress Is Good
- 25. What Should We Do Next
- 26. Define daysBetweenDates
- 27. Step One Pseudocode
- 28. Step Two Helper Function
- 29. Step Three daysBetweenDates
- 30. Test for Valid Inputs
- 31. Real World Problem
- 32. Best Strategy
- 33. Completing the Problem
- 34. Finish daysBetweenDates
- 35. Solution Step I
- 36. Solution Step II
- 37. Solution Step III
- 38. Solution Step IV
- 39. Conclusion